Concurrent Nonmalleable Commitments
نویسندگان
چکیده
منابع مشابه
Nonmalleable Cryptography
The notion of non-malleable cryptography, an extension of semantically secure cryptography , is deened. Informally, the additional requirement is that given the ciphertext it is impossible to generate a diierent ciphertext so that the respective plaintexts are related. The same concept makes sense in the contexts of string commitment and zero-knowledge proofs of possession of knowledge. Non-mal...
متن کامل4-Round Concurrent Non-Malleable Commitments
The round complexity of non-malleable commitments and non-malleable zero knowledge arguments has been an open question for long time. Very recent results of Pass [TCC 2013] and of Goyal et al. [FOCS 2014, STOC 2016], gave almost definitive answers. In this work we show how to construct round-efficient non-malleable protocols via compilers. Starting from protocols enjoying limited non-malleabili...
متن کاملSimulatable Commitments and Efficient Concurrent Zero-Knowledge
We define and construct simulatable commitments. These are commitment schemes such that there is an efficient interactive proof system to show that a given string c is a legitimate commitment on a given value v, and furthermore, this proof is efficiently simulatable given any proper pair (c, v). Our construction is provably secure based on the Decisional Diffie-Hellman (DDH) assumption. Using s...
متن کاملManaging commitments in multiple concurrent negotiations
Automated negotiation by software agents is a key enabling technology for agent mediated e-commerce. To this end, this paper considers an important class of such negotiations — namely those in which an agent engages in multiple concurrent bilateral negotiations for a good or service. In particular, we consider the situation in which a buyer agent is looking for a single service provider from a ...
متن کاملConcurrent Non-Malleable Commitments (and More) in 3 Rounds
The round complexity of commitment schemes secure against man-in-the-middle attacks has been the focus of extensive research for about 25 years. The recent breakthrough of Goyal, Pandey and Richelson [STOC 2016] showed that 3 rounds are sufficient for (one-left, one-right) non-malleable commitments. This result matches a lower bound of [Pas13]. The state of affairs leaves still open the intrigu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060661880